On a problem in extremal graph theory

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a problem in extremal graph theory

The number T*(n, k) is the least positive integer such that every graph with n = (*:I) + t vertices (t > 0) and at least T*(n, k) edges contains k mutually vertex-disjoint complete subgraphs S, , S, ,..., Sk where S, has ivertices, I < i Q k. Obviously T*(n, k) > T(n, k), the Turan number of edges for a Ki . It is shown that if n > gkk” then equality holds and that there is c :0 such that for (...

متن کامل

On a valence problem in extremal graph theory

Let L # Kp be a p-chromatic graph and e be are edge of I, such that L e is (p IL)chromatic. If Cn is a graph of n vertices without contain&g L but containing Kp, then the minimum valence of Gn is

متن کامل

On a Valence Problem in Extremal Graph Theory P.erdös

Let L # Kp be a p-chromatic graph and e be an edge of L such that L e is (p 1)chromatic . If G n is a graph of n vertices without containing L but containing Kp , then the minimum valence of G" is 0. Notation We consider only graphs without loops and multiple edges . The number of edges, vertices and the chromatic number of a graph G will be denoted by n (1 p13/2 •) +0(1) . e(G), u(G), X(G), re...

متن کامل

An Extremal Problem in Graph Theory

G(?z; I) will denote a graph of n vertices and 1 edges. Let fO(lz, K) be the smallest integer such that there is a G (n; f,, (n, k)) in which for every set of K vertices there is a vertex joined to each of these. Thus for example fO(3, 2) = 3 since in a triangle each pair of vertices is joined to a third. It can readily be checked that f,(4, 2) = 5 (the extremal graph consists of a complete 4-g...

متن کامل

Notes on Extremal Graph Theory

What you see below are notes related to a course that I have given several times in Extremal Graph Theory. I guarantee no accuracy with respect to these notes and I certainly do not guarantee completeness or proper attribution. This is an early draft and, with any luck and copious funding, some of this can be made into a publishable work and some will just remain as notes. Please do not distrib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1977

ISSN: 0095-8956

DOI: 10.1016/0095-8956(77)90038-7